Tight bounds for the identical parallel machine-scheduling problem: Part II
نویسندگان
چکیده
منابع مشابه
Tight bounds for the identical parallel machine scheduling problem
We address the problem of minimizing makespan on identical parallel machines. We propose new lower bounding strategies and heuristics for this fundamental scheduling problem. The lower bounds are based on the so-called lifting procedure. In addition, two optimization-based heuristics are proposed. These heuristics require iteratively solving a subset-sum problem. We present the results of compu...
متن کاملTight Approximation for Scheduling Parallel Job on Identical Clusters
In the grid computing paradigm, several clusters share their computing resources in order to distribute the workload. Each of the N cluster is a set of m identical processors (connected by a local interconnection network), and n parallel jobs are submitted to a centralized queue. A job Jj requires qj processors during pj units of time. We consider the Multiple Cluster Scheduling Problem (MCSP )...
متن کاملImproved Bounds on Relaxations of a Parallel Machine Scheduling Problem
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the average completion time of the optimal nonpreemptive schedule to that of the optimal preemptive schedule is at most 3 , improving a bound of (3− 1 m ) due to Phillips, Stein and Wein. We then use our technique to giv...
متن کاملParallel Machine Scheduling Problem
A new constructive heuristic for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is described. The proposed algorithm, which is an n logn algorithm as the LPT algorithm of Graham, iteratively combines partial solutions that are obtained by partitioning the set of jobs in suitable families of subsets. The algorithm was tested using di...
متن کاملLower Bounds for Parallel Machine Scheduling Problems
We study the parallel machine scheduling problem with release dates and we consider several “min-sum” objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2008
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2007.00605.x